Brownian Computation Is Thermodynamically Irreversible
نویسنده
چکیده
The thermodynamics of computation applies ideas from thermal and statistical physics to physical devices implementing computations. Its major focus has been to characterize the principled limits to thermal dissipation in these devices. The best case of no dissipation arises when we use processes that create no thermodynamic entropy. They are thermodynamically reversible processes in which all driving forces are in perfect balance. Thermal fluctuations, such as arise through random molecular motions, are not normally a major consideration in thermodynamic analyses. However, they become decisive in the thermodynamics of computation. For the thermodynamic dissipation associated with
منابع مشابه
On Brownian computation
as a way of demonstrating that logically reversible mathematical operations can be computed by physical processes that are thermodynamically reversible, or nearly so. In a recent paper 4 , I have argued that the computational processes they describe are not thermodynamically reversible and that their misidentification rested on a misapplication of thermal and statistical physics. A question lef...
متن کاملThe End of the Thermodynamics of Computation : A No Go Result
The thermodynamics of computation assumes that computational processes at the molecular level can be brought arbitrarily close to thermodynamical reversibility; and that thermodynamic entropy creation is unavoidable only in data erasure or the merging of computational paths, in accord with Landauer’s principle. The no go result shows that fluctuations preclude completion of thermodynamically re...
متن کاملThermodynamics of natural selection III: Landauer's principle in computation and chemistry.
This is the third in a series of three papers devoted to energy flow and entropy changes in chemical and biological processes, and their relations to the thermodynamics of computation. The previous two papers have developed reversible chemical transformations as idealizations for studying physiology and natural selection, and derived bounds from the second law of thermodynamics, between informa...
متن کاملLogical Reversibility of Computation *
The usual general-purpose computing automaton (e.g.. a Turing machine) is logically irreversibleits transition function lacks a single-valued inverse. Here i t is shown that such machines may he made logically reversible at every step, while retainillg their simplicity and their ability to do general computations. This result is of great physical interest because it makes plausible the existenc...
متن کاملQuantum Error Correction
⋆ It seems very unlikely that quantum computation can be realized unless there is some means of correcting the errors which will inevitably arise when physical devices are constructed to carry out such a computation. The situation is far different from that in ordinary “classical” computers in which for most purposes the probabilities of errors are so small that they can be ignored. • The absen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013